B-W Analysis: A Backward Reachability Analysis for Diagnostic Problem Solving Suitable to Parallel Implementation
نویسندگان
چکیده
Backward reachability on Petri net models has been proposed since the beginning of the development of net theory without giving it a suitable motivation. For this reason, reachability analysis has been successively developed essentially by taking into account forward reachability. In this paper backward reachability analysis is motivated by showing its suit-ability to diagnostic problem solving. A particular technique for backward reachability analysis (B-W analysis) is deened for a net model called Be-havioral Petri Net (BPN), intended to model the behavior of a system to be diagnosed. Such a technique is based on the use of two diierent types of tokens (normal and inhibitor tokens) whose aim is to represent the truth or falsity of the condition associated to a marked place. A distributed approach for parallel B-W analysis is also proposed. Such an approach is based on a set of processes derived from the structure of a BPN by means of a formal partitioning technique; this allows us to address the problem of mitigating the high ineeciency diagnostic algorithms usually have.
منابع مشابه
Parallel Model-Based Diagnosis Using PVM
Extended Abstract The present work concerns the PVM implementation of a parallel approach to model-based diagnosis, using a Petri net model 4] of the behavior of the system to be diagnosed. Solving a diagnostic problem usually involves nding the primary causes that produce a particular malfunction, whose eeects are observed in the behavior of a given system. In the model-based approach to diagn...
متن کاملBackward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure and hence conclude the decidability of the safety problem. Although backward reachability is property-directed, it can unnecessarily explore (large) portions of the state space of a system which are not required to ver...
متن کاملBackward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure and hence conclude the decidability of the safety problem. Although backward reachability is property-directed, it can unnecessarily explore (large) portions of the state space of a system which are not required to ver...
متن کاملPetri Net Reachability Analysis meets Model-Based Diagnostic Problem Solving
| The present paper describes the formal connection between model-based diagnostic problem solving (usually performed inside logical frameworks) and Petri net reachability analysis , in case the model of the device under examination is described through a net model. We show that, by suitably re-formulating a diagnostic problem in a net-based setting, the characterization of the diagnostic proce...
متن کاملA numerical scheme for solving nonlinear backward parabolic problems
In this paper a nonlinear backward parabolic problem in one dimensional space is considered. Using a suitable iterative algorithm, the problem is converted to a linear backward parabolic problem. For the corresponding problem, the backward finite differences method with suitable grid size is applied. It is shown that if the coefficients satisfy some special conditions, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994